Integer factorization and Discrete Logarithm problem are neither in P nor NP-complete
نویسنده
چکیده
Though integer factorization and discrete logarithm problem are both practically and theoretically important, the computational complexity of these problems remained unknown. By comparing integer factorization problem with a problem in P and NP-complete problems, I show that the decision problem version of integer factorization problem is neither in P nor NP-complete. In addition, integer factorization problem is shown to be as hard as discrete logarithm problem (mod n). From this result, the conclusion that P 6= NP is reached.
منابع مشابه
Comments on Wei’s Digital Signature Scheme Based on Two Hard Problems
In 1998, Shao proposed two digital signature schemes and claimed that the security of which is based on the difficulties of computing both integer factorization and discrete logarithm. However, at the same year, Li and Xiao demonstrated that Shao’s schemes are insecure are not based on any hard problem. Recently, Wei proposed two “Digital Signature Schemes Based on Two Hard Problems” to improve...
متن کاملImproved Shao's Signature Scheme
In 1998, Shao proposed two digital signature schemes and claimed that the security of which is based on the difficulties of computing both integer factorization and discrete logarithm. However, in 1999, Lee demonstrated that Shao’s signature schemes can be broken if the factorization problem can be solved. This paper presents an improvement of Shao’s signature schemes and shows that it can resi...
متن کاملA Digital Signature Scheme based on two hard problems
In this paper we propose a signature scheme based on two intractable problems, namely the integer factorization problem and the discrete logarithm problem for elliptic curves. It is suitable for applications requiring long-term security and provides smaller signatures than the existing schemes based on the integer factorization and integer discrete logarithm problems.
متن کاملThe Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem
Let E=F p be an elliptic curve deened over a nite eld, and let S;T 2 E(F p) be two points on E. The Elliptic Curve Discrete Logarithm Problem (ECDLP) asks to nd an integer m so that S = mT in E(F p). In this note we give a new algorithm, dubbed the Xedni Calculus, which might be used to solve the ECDLP. As remarked by Neal Koblitz, the Xedni method is also applicable to the classical discrete l...
متن کاملThe Discrete Logarithm Problem as an Optimization Task: A First Study
Most of the contemporary cryptographic systems are based on mathematical problems whose solutions are generally intractable in polynomial time; such problems are the discrete logarithm problem and the integer factorization problem. In this contribution we consider the discrete logarithm problem as an Integer Programming Problem. Two Evolutionary Computation methods, namely the Particle Swarm Op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1207.2171 شماره
صفحات -
تاریخ انتشار 2012